General Sub-packetized Access-Optimal Regenerating Codes
نویسندگان
چکیده
منابع مشابه
On Optimal Heterogeneous Regenerating Codes
Heterogeneous Distributed Storage Systems (DSSs) are close to the real world applications for data storage. Each node of the considered DSS, may store different number of packets and each having different repair bandwidth with uniform repair traffic. For such heterogeneous DSS, a failed node can be repaired with the help of some specific nodes. In this work, a family of codes based on graph the...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملShortened regenerating codes
For general exact repair regenerating codes, the optimal trade-offs between storage size and repair bandwith remain undetermined. Various outer bounds and partial results have been proposed. Using a simple chain rule argument we identify nonnegative differences between the functional repair and the exact repair outer bounds. One of the differences is then bounded from below by the repair data o...
متن کاملA Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes
Let C be an {(n, k, d), (α, β)} linear, Minimum Storage Regenerating (MSR) code over the vector alphabet Fq with linear repair of a failed node. Then C has the property that repair of the failure of any one single node (data or parity) can be carried out using linear operations, by uniformly downloading β symbols from a collection of d helper nodes. It is known that the minimum amount dβ of dat...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2016
ISSN: 1089-7798
DOI: 10.1109/lcomm.2016.2561287